A Competitive Nature-Inspired Cuckoo Search Algorithm for Solving the Resource Constrained Project Scheduling Problem

Since its advent, the resource constrained project scheduling problem has been a favorite NP-Hard studied by many researchers. In this paper, we examine with focus on total time minimization, usually known as makespan minimization. To end, nature-inspired Cuckoo Search Algorithm (CSA) introduced that works simulating brooding parasitism of some cuckoo birds in nature. nutshell, proposed search algorithm two main capabilities including: a) global random using Levy flights, and b) local refinement strategy. addition, double justification method employed to improve generated solutions. Simultaneous use these features can maximize efficiency searches uncertain environments. Experimental results standard J30, J60, J120 test sets from PSPLIB are also presented, showing CSA satisfying compared other well-reported algorithms.